Adaptive Chaotic Marine Predators Hill Climbing Algorithm for Large-scale Design Optimisations

نویسندگان

چکیده

Meta-heuristic algorithms have been effectively employed to tackle a wide range of optimisation issues, including structural engineering challenges. The the shape and size large-scale truss structures is difficult due nonlinear interplay between cross-sectional nodal coordinate pressures structures. Recently, it was demonstrated that newly proposed Marine Predator Algorithm (MPA) performs very well on mathematical MPA meta-heuristic simulates essential hunting habits natural marine predators. However, this algorithm has some disadvantages, such as becoming locked in locally optimal solutions not exhibiting high level exploratory behaviour. This paper proposes two hybrid predator algorithms, Nonlinear (HNMPA) Nonlinear-Chaotic (HNCMPA), improved variations paired with hill-climbing (HC) technique for form size. major advantage these techniques are they seek overcome MPA’s disadvantages by using values prolonging exploration phase chaotic values; also, HC used avoid optimum solutions. In terms performance, compared fourteen well-known meta-heuristics, Dragonfly (DA), Henry Gas Solubility (HGSO), Arithmetic (AOA), Generalized Normal Distribution Optimisation (GNDO), Salp Swarm (SSA), Predators (MPA), Neural Network (NNA), Water Cycle (WCA), Artificial Gorilla Troops Optimiser (GTO), Gray Wolf (GWO), Moth Flame (MFO), Multi-Verse (MVO), Equilibrium (EO), Cheetah (CO). Furthermore, seven were chosen test HNCMPA performance benchmark sets, MPA, MVO, PSO, MFO, SSA, GWO, WOA. results experiment demonstrate put forth surpass previously established meta-heuristics field optimisation, encompassing both traditional CEC problems, margin over 95% attaining superior ultimate solution. Additionally, regards solving difficulties real-world challenge, outcomes indicate boost 65% obtaining significantly better problems involving 260-bar 314-bar; conversely, case 340-bar improvement rate slightly lower at almost 25%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An adaptive modified firefly algorithm to unit commitment problem for large-scale power systems

Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off.  In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...

متن کامل

When a genetic algorithm outperforms hill-climbing

A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...

متن کامل

PALO: A Probabilistic Hill-Climbing Algorithm

Many learning systems search through a space of possible performance elements, seeking an element whose expected utility, over the distribution of problems, is high. As the task of nding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum. Unfortunately, even this is problematic as the learner typically does not know the under...

متن کامل

Boolean Function Design Using Hill Climbing Methods

This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptogra...

متن کامل

IMPROVED BAT ALGORITHM FOR OPTIMUM DESIGN OF LARGE-SCALE TRUSS STRUCTURES

Deterring the optimum design of large-scale structures is a difficult task. Great number of design variables, largeness of the search space and controlling great number of design constraints are major preventive factors in performing optimum design of large-scale truss structures in a reasonable time. Meta-heuristic algorithms are known as one of the useful tools to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3266991